template<class Comparable>

void insertionSort(vector<Comparable>& a){
	for(int p = 1; p < a.size(); p++){
		Comparable tmp = a [p];
		int j;
		
		for(j = p; j > 0 && tmp < a[-1];j--){
			a[j] = a[j-1]
		}	
		a[j] = tmp;
	}

}

int main(){

}
